- algorithm object
- Программирование: объект-алгоритм
Универсальный англо-русский словарь. Академик.ру. 2011.
algorithm object
Смотреть что такое "algorithm object" в других словарях:
Object recognition — in computer vision is a task of finding given object in an image or video sequence. Humans recognize a multitude of objects in images with little effort, despite the fact that the image of the objects may vary somewhat in different view points,… … Wikipedia
Object categorization from image search — In computer vision, the problem of object categorization from image search is the problem of training a classifier to recognize categories of objects, using only the images retrieved automatically with an Internet search engine. Ideally,… … Wikipedia
Object recognition (computer vision) — Feature detection Output of a typical corner detection algorithm … Wikipedia
Object theory — For the concept of objects in philosophy, see Object (philosophy). Object theory is a theory in philosophy and mathematical logic concerning objects and the statements that can be made about objects. Contents 1 An informal theory 2 Objects 3 A… … Wikipedia
Algorithm (C++) — In the C++ programming language, algorithm is a function template that can work with (theoretically) any container containing values of any type. However, this is not always true because algorithms may have restrictions on the container/iterator… … Wikipedia
Mark-compact algorithm — In computer science, a mark compact algorithm is a type of garbage collection algorithm used to reclaim unreachable memory. Mark compact algorithms can be regarded as a combination of the mark sweep algorithm and Cheney s copying algorithm. First … Wikipedia
Segmentation based object categorization — The image segmentation problem is concerned with partitioning an image into multiple regions according to some homogeneity criterion. This article is primarily concerned with graph theoretic approaches to image segmentation. Applications of Image … Wikipedia
Cheney's algorithm — Cheney s algorithm, first described in a 1970 ACM paper by C.J. Cheney, is a method of garbage collection in computer software systems. In this scheme, the heap is divided into two equal halves, only one of which is in use at any one time.… … Wikipedia
k-nearest neighbor algorithm — KNN redirects here. For other uses, see KNN (disambiguation). In pattern recognition, the k nearest neighbor algorithm (k NN) is a method for classifying objects based on closest training examples in the feature space. k NN is a type of instance… … Wikipedia
K-nearest neighbor algorithm — In pattern recognition, the k nearest neighbor algorithm ( k NN) is a method for classifying objects based on closest training examples in the feature space. k NN is a type of instance based learning, or lazy learning where the function is only… … Wikipedia
Expectation-maximization algorithm — An expectation maximization (EM) algorithm is used in statistics for finding maximum likelihood estimates of parameters in probabilistic models, where the model depends on unobserved latent variables. EM alternates between performing an… … Wikipedia
